Relational Queries Overview

Principles

Definition

Relational queries is a formal academic concept and methodological approach for retrieving and manipulating data stored within relational database systems. It provides a structured means to access information based on the logical relationships defined between data elements across different relations (tables). This concept investigates the declarative specification of data retrieval and manipulation operations using formalisms rooted in relational algebra and calculus. Key characteristics include its set-based nature, the use of specific operators (such as selection, projection, and join) to filter, combine, and transform data, and its provision of a theoretical foundation for practical query languages. Its significance is paramount in relational database theory and its practical application enables efficient and precise data access in modern data management systems.

Ontological type

Core Operators

Query Optimization

Expressive Power

Key developments

Key Figures

Rule-Driven Semantic Integration era

Jayavel Shanmugasundaram [1] was active at Cornell University [3] and the University of Wisconsin–Madison [4] during the Rule-Driven Semantic Integration era. His contribution on storing and querying ordered XML using a relational database system [6] demonstrated practical integration capabilities that bridged XML with relational storage, underscoring the era's emphasis on rule-based, cross-model semantics. Eugene J. Shekita [2] was associated with the University of Wisconsin–Madison [4] and the University of Wisconsin System [5] in this era. His work on the paper Storing and querying ordered XML using a relational database system [6] highlighted the importance of efficient XML-relational integration for rule-driven mediation and heterogeneous data management.

Uncertainty and Ranking era

Jan Chomicki[1] is associated with the State University of New York[3] and New York University[4] in the Uncertainty and Ranking era (2004–2010). His key contribution in this era is Skyline with presorting[7], a technique that enables efficient top-k ranking by pre-sorting candidates, a crucial enabler for uncertainty-aware query processing. Jeffrey Xu Yu[2] is affiliated with the University of Hong Kong[5] and the Chinese University of Hong Kong[6] in this era. His papers include Finding Top-k Min-Cost Connected Trees in Databases[8], Graph indexing: tree + delta <= graph[9], and PBiTree coding and efficient processing of containment joins[10], which collectively advance scalable structure-aware query processing for graphs and nested data, supporting ranked and uncertainty-aware retrieval in the era.

Semantics and Learned Optimization era

Viktor Leis [1] is a prominent researcher in the Semantics and Learned Optimization era, with affiliations at Technical University of Munich [3] and Friedrich-Alexander-Universität Erlangen-Nürnberg [4]. His key contributions in this era include evaluating the reliability and power of query optimizers in How good are query optimizers, really? [5], proposing learned cardinalities for estimating correlated joins with deep learning [6], and introducing SuRF to leverage learned structures for query optimization [7], collectively advancing data-driven, semantic-aware optimization. Alfons Kemper [2] is also a central figure, associated with Technical University of Munich [3] during this era. His contributions include Adopting worst-case optimal joins in relational database systems [8], and his work on optimizer evaluation [5] and learned cardinalities [6] helped push scalable, worst-case–aware query processing central to this era.